Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
نویسندگان
چکیده
منابع مشابه
Non Deterministic Logic Programs
Non deterministic applications arise in many domains, including, stochastic optimization, multi-objectives optimization, stochastic planning, contingent stochastic planning, reinforcement learning, reinforcement learning in partially observable Markov decision processes, and conditional planning. We present a logic programming framework called non deterministic logic programs, along with a decl...
متن کاملDynamic Detection of Deterministic Computations in Non-Deterministic Functional-Logic Programs
The detection of deterministic computations at run-time can be used to introduce dynamic cuts pruning the search space and thus increasing the efficiency of Functional-Logic systems. This idea was introduced in an early work of R. Loogen and S. Winkler. However the proposal of these authors cannot be used in current implementations because it did not consider non-deterministic functions and was...
متن کاملNon-deterministic semantics for dynamic topological logic
Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...
متن کاملNon-deterministic Semantics for Dynamic Topological Logic
Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...
متن کاملDefinability by Programs in First-Order Structures
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ti 1. Preliminarv detinitilms and results . . . . . . . . . . . . . . . . . . . . . . . . . Algebraic characterizations of the unwind property .................. A structure with the unwind property for every iterative (but not every recursive 1 program . The truth-table property ............................. Struc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1985
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80002-4